Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts

We derive the limit shape of Young diagrams, associated with growing integer partitions, with respect to multiplicative probability measures underpinned by the generating functions of the form F(z) = ∞l=1F0(zl) (which entails equal weighting among possible parts l ∈ N). Under mild technical assumptions on the function H0(u) = ln(F0(u)), we show that the limit shape ω∗(x) exists and is given by the equation y = γ−1H0(e−γx), where γ2 = ∫ 1 0 u −1H0(u) du. The wide class of partition measures covered by this result includes (but is not limited to) representatives of the three meta-types of decomposable combinatorial structures — assemblies, multisets and selections. Our method is based on the usual randomization and conditioning; to this end, a suitable local limit theorem is proved. The proofs are greatly facilitated by working with the cumulants of sums of the part counts rather than with their moments.